Incremental Network Design with Minimum Spanning Trees
نویسندگان
چکیده
Given an edge-weighted graph G = (V,E) and a set E0 ⊂ E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e1, . . . , e ′ r ∈ E \ E0 minimizing ∑T t=1 w(Xt) where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0 ∪ {e1, . . . , et}) and T = |E \ E0|. We prove that this problem can be solved by a greedy algorithm.
منابع مشابه
Optimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملA new evolutionary approach to the degree-constrained minimum spanning tree problem
Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a wellstudied NP-hard problem of importance in communications network design and other network-related problems. In this paper we describe some previously proposed algorithms for solving the problem, and then introduce a novel tree construction algorithm called the Randomised Primal Method (RPM) which builds degree-const...
متن کاملSpanning Trees and Spanners
We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
متن کاملEdge sets: an effective evolutionary coding of spanning trees
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that will act on that representation. We propose representing spanning trees in evolutionary algorithms for network design problems directly as sets of their edges, and we describe initialization, recombination, and mutation operators for this representation. The operators...
متن کاملProviding a Simple Method for the Calculation of the Source and Target Reliabili- ty in a Communication Network (SAT)
The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 21 شماره
صفحات -
تاریخ انتشار 2017